Interactive Pattern Mining Using Discriminant Sub-patterns as Dynamic Features

نویسندگان

چکیده

Recent years have seen a shift from pattern mining process that has users define constraints before-hand, and sift through the results afterwards, to an interactive one. This new framework depends on exploiting user feedback learn quality function for patterns. Existing approaches weakness in they use static pre-defined low-level features, attempt independent weights representing their importance user. As alternative, we propose work with more complex features are derived directly ranking imposed by Those used be aggregated help drive right direction. Experiments UCI datasets show using higher-complexity leads selection of patterns better aligned hidden while being competitively fast when compared state-of-the-art methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive Data Exploration Using Pattern Mining

We live in the era of data and need tools to discover valuable information in large amounts of data. The goal of exploratory data mining is to provide as much insight in given data as possible. Within this field, pattern set mining aims at revealing structure in the form of sets of patterns. Although pattern set mining has shown to be an effective solution to the infamous pattern explosion, imp...

متن کامل

On Interactive Pattern Mining from Relational Databases

In this paper we present ConQueSt, a constraint based querying system devised with the aim of supporting the intrinsically exploratory (i.e., human-guided, interactive, iterative) nature of pattern discovery. Following the inductive database vision, our framework provides users with an expressive constraint based query language which allows the discovery process to be effectively driven toward ...

متن کامل

Interactive Constraint-Based Sequential Pattern Mining

Data mining is an interactive and iterative process. It is very likely that a user will execute a series of similar queries differing in pattern constraints and mining parameters, before he or she gets satisfying results. Unfortunately, data mining algorithms currently available suffer from long processing times, which is unacceptable in case of interactive mining. In this paper we discuss effi...

متن کامل

Dynamic Knowledge Extraction from Software Systems Using Sequential Pattern Mining

Software system analysis for identifying software functionality in source code remains as a major problem in the reverse engineering literature. The early approaches for extracting software functionality mainly relied on static properties of software system. However the static approaches by nature suffer from the lack of semantic and hence are not appropriate for this task. This paper presents ...

متن کامل

Graph-Based Substructure Pattern Mining Using CUDA Dynamic Parallelism

CUDA is an advanced massively parallel computing platform that can provide high performance computing power at much more affordable cost. In this paper, we present a parallel graph-based substructure pattern mining algorithm using CUDA Dynamic Parallelism. The key contribution is a parallel solution to traversing the DFS (Depth First Search) code tree. Furthermore, we implement a parallel frequ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2023

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-33374-3_20